Housekeeping for prefix coding
نویسندگان
چکیده
We consider the problem of constructing and transmitting the prelude for Huffman coding. With careful organization of the required operations and an appropriate representation for the prelude, it is possible to make semistatic coding efficient even when , the size of the source alphabet, is of the same magnitude as , the length of the message being coded. The proposed structures are of direct relevance in applications that mimic one-pass operation through the use of semistatic compression on a block-by-block basis.
منابع مشابه
Strain typing of Toxoplasma gondii: comparison of antigen-coding and housekeeping genes.
Molecular characterization of Toxoplasma gondii isolates is central for understanding differences in disease transmission and manifestations. Only 3 subgroups (lineages) have been discerned with subtle within-lineage variation, permitting low-resolution classification of isolates. Because proteins, coding sequences, and especially antigen-coding genes have been used extensively in previous stud...
متن کاملImproving Chinese Storing Text Retrieval Systems' Security via a Novel Maximal Prefix Coding
As we have seen that Huffman coding has been widely used in data, image, and video compression. In this paper novel maximal prefix coding is introduced. Relationship between the Huffman coding and the optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are optimal maximal prefix coding schemes and that conversely the optimal maximal prefix coding schemes need no...
متن کاملOptimal Maximal Prefix Coding and Huffman Coding
Huffman coding has been widely used in data, image, and video compression. Novel maximal prefix coding different from the Huffman coding is introduced. Relationships between the Huffman coding and optimal maximal prefix coding are discussed. We show that all Huffman coding schemes are maximal prefix coding schemes and have the shortest average code word length among maximal prefix coding scheme...
متن کاملPrefix Codes for Power Laws with Countable Support
In prefix coding over an infinite alphabet, methods that consider specific distributions generally consider those that decline more quickly than a power law (e.g., Golomb coding). Particular power-law distributions, however, model many random variables encountered in practice. For such random variables, compression performance is judged via estimates of expected bits per input symbol. This corr...
متن کاملOn Adaptive Strategies for an Extended Family of Golomb-type Codes
Off-centered, two-sided geometric distributions of the integers are often encountered in lossless image compression applications, as probabilistic models for prediction residuals. Based on a recent characterization of the family of optimal prefix codes for these distributions, which is an extension of the Golomb codes, we investigate adaptive strategies for their symbol-by-symbol prefix coding,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Communications
دوره 48 شماره
صفحات -
تاریخ انتشار 2000